CPSC 502 - Project paper Complexity and Representation of Coalitional Games
نویسنده
چکیده
Coalitional game theory is a sub-area of game theory that models situations where agents can benefit from cooperation. Its representations and solution concepts are NP-hard in the general case. I describe some of the major solution concepts and survey two papers that deal with this general-case intractability. The first studies a specific well-motivated coalitional game and finds that two solution concepts (the core and nucleolus) are tractable in that special case. The second paper provides a gracefully-degrading general representation and algorithms for computing some solution concepts (the Shapley value and the core) from that representation.
منابع مشابه
Core Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کاملRepresentation of coalitional games with algebraic decision diagrams
With the advent of algorithmic coalitional game theory, it is important to design coalitional game representation schemes that are both compact and efficient with respect to solution concept computation. To this end, we propose a new representation for coalitional games, which is based on Algebraic Decision Diagrams (ADDs). Our representation is fully expressive, compact for many games of pract...
متن کاملInfeasibility Certificates and the Complexity of the Core in Coalitional Games
This paper characterizes the complexity of the core in coalitional games. There are different proposals for representing coalitional games in a compact way, where the worths of coalitions may be computed in polynomial time. In all those frameworks, it was shown that core non-emptiness is a co-NPhard problem. However, for the most general of them, it was left as an open problem whether it belong...
متن کاملHedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ranging from multi-agent coordination to group formation in social networks. However, the practical application of hedonic games is hindered by the fact that the naive representation for such games is exponential in th...
متن کاملA Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams
Coalitional games, including Coalition Structure Generation (CSG), have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. Previous studies have found that many problems in coalitional games tend to be computationally intractable in this black-box function representation....
متن کامل